Confluent persistence revisited
نویسندگان
چکیده
It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited space overhead. Updates are performed in O(log n) amortized time, and following a pointer takes O(log c log n) time where c is the in-degree of a node in the data structure. In particular, this proves that confluent persistence can be achieved at a logarithmic cost in the bounded in-degree model used widely in previous work. This is a O(n/ log n)-factor improvement over the previous known transform to make a data structure confluently persistent.
منابع مشابه
Persistence of Termination for Locally Confluent Overlay Term Rewriting Systems
A property is called persistent if for any manysorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that termination is persistent for locally confluent overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that co...
متن کاملA Reactive, Confluently Persistent Framework for the Design of Computer Music Systems
The process of composition can be seen as sequence of manipulations on the material. In algorithmic composition, such sequences are prescribed through another set of sequences which yield the algorithm. In a realtime situation the sequences may be closely linked to the temporal sequence of the unfolding musical structure, but in general they form orthogonal temporal graphs on their own. We pres...
متن کاملConfluently Persistent Sets and Maps
Abstract Ordered sets and maps play important roles as index structures in relational data models. When a shared index in a multi-user system is modified concurrently, the current state of the index will diverge into multiple versions containing the local modifications performed in each work flow. The confluent persistence problem arises when versions should be melded in commit and refresh oper...
متن کاملKolmogorov Theorem Revisited
Kolmogorov Theorem on the persistence of invariant tori of real analytic Hamiltonian systems is revisited. In this paper we are mainly concerned with the lower bound on the constant of the Diophantine condition required by the theorem. From the existing proofs in the literature, this lower bound turns to be ofO(ε1/4), where ε is the size of the perturbation. In this paper, by means of careful (...
متن کاملTransformations of Conditional Rewrite Systems Revisited
We revisit known transformations of conditional rewrite systems to unconditional ones in a systematic way. We present a unified framework for describing, analyzing and classifying such transformations, discuss the major problems arising, and finally present a new transformation which has some advantages as compared to the approach of [6]. The key feature of our new approach (for left-linear con...
متن کامل